Matrix shapes invariant under the symmetric QR algorithm
نویسندگان
چکیده
It is shown, which zero patterns of symmetric matrices are preserved under the QR algorithm.
منابع مشابه
Adding Aggressive Early Deflation to the Restructured Symmetric QR Algorithm
The QR algorithm is an algorithm for computing the spectral decomposition of a symmetric matrix [9]. Despite it’s high accuracy, other methods are often preferred for the symmetric eigenvalue problem due to the QR algorithm’s relatively poor performance [13]. In recent years, new techniques have arisen that dramatically improve its performance. The restructured symmetric QR algorithm, introduce...
متن کاملSlices of Matrices — a Scenario for Spectral Theory
Given a real, symmetric matrix S, we define the slice FS through S as being the connected component containing S of two orbits under conjugation: the first by the orthogonal group, and the second by the upper triangular group. We describe some classical constructions in eigenvalue computations and integrable systems which keep slices invariant — their properties are clarified by the concept. We...
متن کاملComputing the rank revealing factorization of symmetric matrices by the semiseparable reduction
An algorithm for reducing a symmetric dense matrix into a symmetric semiseparable one by orthogonal similarity transformations and an efficient implementation of the QR–method for symmetric semiseparable matrices have been recently proposed. In this paper, exploiting the properties of the latter algorithms, an algorithm for computing the rank revealing factorization of symmetric matrices is con...
متن کاملOn Computing the Eigenvectors of Symmetric Tridiagonal and Semiseparable Matrices
A real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used approach to compute the spectrum of such matrices reduces first the dense symmetric matrix into a symmetric structured one, i.e., either a tridiagonal matrix [2, 3] or a semiseparable matrix [4]. This step is accomplished in O(n) operations. Once the latter symmetric structured matrix is available, its s...
متن کاملA Fast QR Algorithm for Companion Matrices
It has been shown in [4, 5, 6, 31] that the Hessenberg iterates of a companion matrix under the QR iterations have low off-diagonal rank structures. Such invariant rank structures were exploited therein to design fast QR iteration algorithms for finding eigenvalues of companion matrices. These algorithms require only O(n) storage and run in O(n) time where n is the dimension of the matrix. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 2 شماره
صفحات -
تاریخ انتشار 1995